# probabilistic approach

**tikimybinis***metodas**statusas*__T__*sritis*__automatika__*atitikmenys*:*angl.*probabilistic approach; probability method*vok.*Wahrscheinlichkeitsmethode, f*rus.*вероятностный метод, m*pranc.*méthode de probabilité, f*ryšiai*:*sinonimas*– stochastinis metodas

*Automatikos terminų žodynas. – Vilnius: Technika.
Vilius Antanas Geleževičius, Angelė Kaulakienė, Stanislovas Marcinkevičius.
2004.*

### Look at other dictionaries:

**Probabilistic design**— is a discipline within Engineering Design. It deals primarily with the consideration of the effects of random variability upon the performance of an engineering system during the design phase. Typically, these effects are related to quality and… … Wikipedia**Probabilistic interpretation of Taylor series**— In mathematics, the Taylor series is a power series associated to a function. From a probabilistic point of view, the Taylor series is the most natural approximation of that function.More precisely, the Taylor polynomial of degree , n , is the… … Wikipedia**Probabilistic encryption**— is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general, yield different ciphertexts. The term probabilistic encryption is typically used in reference to public key… … Wikipedia**Probabilistic latent semantic analysis**— (PLSA), also known as probabilistic latent semantic indexing (PLSI, especially in information retrieval circles) is a statistical technique for the analysis of two mode and co occurrence data. PLSA evolved from Latent semantic analysis, adding a… … Wikipedia**Probabilistic causation**— designates a group of philosophical theories that aim to characterize the relationship between cause and effect using the tools of probability theory. The central idea behind these theories is that causes raise the probabilities of their effects … Wikipedia**Probabilistic analysis of algorithms**— In analysis of algorithms, probabilistic analysis of algorithms is an approach to estimate the computational complexity of an algorithm or a computational problem. It starts from an assumption about a probabilistic distribution of the set of all… … Wikipedia**Probabilistic logic**— The aim of a probabilistic logic (or probability logic) is to combine the capacity of probability theory to handle uncertainty with the capacity of deductive logic to exploit structure. The result is a richer and more expressive formalism with a… … Wikipedia**Approach space**— In topology, approach spaces are a generalization of metric spaces, based on point to set distances, instead of point to point distances. They were introduced by [http://www.math.ua.ac.be/TOP/ Robert Lowen] in 1989.DefinitionGiven a metric space… … Wikipedia**Dominance-based Rough Set Approach**— (DRSA) is an extension of rough set theory for Multi Criteria Decision Analysis (MCDA), introduced by Greco, Matarazzo and Słowiński Greco, S., Matarazzo, B., Słowiński, R.: Rough sets theory for multicriteria decision analysis. European Journal… … Wikipedia**Dominance-based rough set approach**— (DRSA) is an extension of rough set theory for multi criteria decision analysis (MCDA), introduced by Greco, Matarazzo and Słowiński. [1][2][3] The main change comparing to the classical rough sets is the substitution of the indiscernibility… … Wikipedia